Probability of diameter two for Steinhaus graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diameter Two Graphs of Minimum Order with Given Degree Set

The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...

متن کامل

Generalized steinhaus graphs

A generalized Steinhaus graph of order n and type s is a graph with n vertices whose adjacency matrix (a i;j) satisses the relation a i;j =

متن کامل

Parity-regular Steinhaus graphs

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n−1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic binary sequences 110...110 of any length n − 1 = 3m. By an exhaustive search the conjecture was known to hold up to 25 vertices. We report h...

متن کامل

Uniform generalized Steinhaus graphs

In [1] it is shown that the first order theory of almost all generalized Steinhaus graphs is identical to the first order theory of almost all where each generalized Steinhaus graph is given the same probability. A natural probability measure on generalized Steinhaus graphs is obtained by independently assigning a probability of p for each entry in the generating string of the graph. With this ...

متن کامل

Characterizations of bipartite Steinhaus graphs

We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this recursion. Also, we exhibit a lower bound, which is achieved infinitely often, for the number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1993

ISSN: 0166-218X

DOI: 10.1016/0166-218x(93)90036-n